A Hybrid Recon guration Scheme for Real - TimeFault - Tolerant
نویسندگان
چکیده
Non-stop operation, despite the occurrence of faults, is a key requirement for highly-reliable, real-time systems , such as aircraft and nuclear reactor controller computers. Reconnguration is commonly used to mean the process of transforming the execution structure of a system from one state to another when a fault occurs. We identiied two types of reconngura-tion: fault-tolerating reconnguration (upon occurrence of each fault) and performability-enhancing reconngu-ration (independently of fault occurrences). This paper proposes a hybrid reconnguration scheme for real-time fault-tolerant systems. The proposed scheme not only meets the timing constraints or deadlines of hard real-time jobs, but also maintains high performability. In this scheme, a system reconngures itself either when a fault occurs or when a job arrives or completes its execution.
منابع مشابه
Algorithm - Based Fault - Tolerant Strategies in FaultyHypercube and Star
This dissertation addresses the design of algorithm-based fault-tolerant strategies in faulty hypercube and star graph multicomputers without hardware modi cation. Several new concepts and designs are presented here under the permanent and transient fault models. Under the permanent fault model, we propose a new fault-tolerant recon guration scheme in the faulty hypercube and star graph multico...
متن کاملThe Erlangen Slot Machine - An FPGA-Based Partially Reconfigurable Computer
Partial recon guration is a special case of device con guration that allows to change only parts of a hardware circuit at run-time. Only a prede ned region of an FPGA is updated while the remainder of the device continues to operate undisturbed. This is especially valuable when a device operates in a missioncritical environment and cannot be disrupted while a subsystem is rede ned for performan...
متن کاملSensitivity Loss versus Duration of Reconnguration and Alma Array Design
The analysis of e ective time loss during recon guration by Guilloteau (1999) is re-examined for the robustness of his conclusion that the time loss is minimized by moving only a small number of antennas each day. I am able to reproduce this analysis and found that this conclusion is independent of the assumptions on antenna move time and the length of post-move calibration. I nd, however, this...
متن کاملHybrid Data/Configuration Caching for Striped FPGAs
In recent years interest in the area of custom com puting machines CCMs has been on a steady increase Much of the activity surrounding CCMs has centered around Field Programmable Gate Array FPGA tech nology and rapid prototyping applications For sup porting applications FPGAs are recon gured to allow pieces of the application to be mapped on it temporally The performance of the FPGA when used a...
متن کاملGracefully Degrading Systems Using the Bulk-Synchronous Parallel Model with Randomised Shared Memory
The Bulk-Synchronous Parallel Model, BSPM, was proposed as a bridging model for parallel computation by Valiant. By using Randomised Shared Memory, RSM, this model o ers an asymptotically optimal emulation of the PRAM[1]. By using the BSPM with RSM, we show how a gracefully degrading massively parallel system can be obtained through: memory duplication to ensure global memory integrity, and to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007